Estimation of intercity freight origin-destination matrix using simulated annealing algorithm
نویسندگان
چکیده
منابع مشابه
Compressive Origin-Destination Matrix Estimation
The paper presents an approach to estimate OriginDestination (OD) flows and their path splits, based on traffic counts on links in the network. The approach called Compressive Origin-Destination Estimation (CODE) is inspired by Compressive Sensing (CS) techniques. Even though the estimation problem is underdetermined, CODE recovers the unknown variables exactly when the number of alternative pa...
متن کاملNumeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm
Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...
متن کاملCompressive Origin-Destination Estimation
The paper presents an approach to estimate OriginDestination (OD) flows and their path splits, based on traffic counts on links in the network. The approach called Compressive Origin-Destination Estimation (CODE) is inspired by Compressive Sensing (CS) techniques. Even though the estimation problem is underdetermined, CODE recovers the unknown variables exactly when the number of alternative pa...
متن کاملThe Elevator Trip Origin-Destination Matrix Estimation Problem
We present a constraint programming formulation for the elevator trip origin-destination matrix estimation problem, and propose different approaches to solve the problem. An elevator trip consists of successive stops in one direction of travel with passengers inside the elevator. It can be defined as a directed network, where the nodes correspond to the stops on the trip, and the arcs to the po...
متن کاملThe Origin–Destination Matrix Estimation Problem — Analysis and Computations
For most kind of analyses in the field of traffic planning, there is a need for origin– destination (OD) matrices, which specify the travel demands between the origin and destination nodes in the network. This thesis concerns the OD-matrix estimation problem, that is, the calculation of OD-matrices using observed link flows. Both time-independent and time-dependent models are considered, and we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Uncertain Supply Chain Management
سال: 2018
ISSN: 2291-6822,2291-6830
DOI: 10.5267/j.uscm.2017.6.005